Critical Groups of Some Regular Line Graphs
نویسنده
چکیده
We describe the critical group of the line graph of the complete bipartite graph Kp,q . Data is presented that describes the structure of the critical group of some regular line graphs in terms of the critical group of the original graph. This suggests the existence of a large class of regular graphs with such a property.
منابع مشابه
Critical Groups and Line Graphs
This paper is an overview of what the author has learned about the critical group of a graph, including some new results. In particular we discuss the critical group of a graph in relation to that of its line graph when the original graph is regular. We begin by introducing the critical group from various aspects. We then study the subdivision graph and line graph in relation to the critical gr...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملThe Critical Group of a Line Graph: The Bipartite Case
The critical group K(G) of a graph G is a finite abelian group whose order is the number of spanning forests of the graph. Here we investigate the relationship between the critical group of a regular bipartite graph G and its line graph lineG. The relationship between the two is known completely for regular nonbipartite graphs. We compute the critical group of a graph closely related to the com...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004